منابع مشابه
On enumerating chordless circuits in directed graphs
We introduce and discuss an algorithm using O(p) time and O(n(n + m)) space for enumerating the m > 0 chordless circuits in a digraph of order n and containing p chordless paths. Running it on random digraphs yields some statistical insight into its practical performance.
متن کاملEnumerating Families of Labeled Graphs
In 1966, Rosa introduced, among others, αand β-labelings as tools to solve the isomorphic decomposition problem of the complete graph. Ten years later, Sheppard calculated the number of αand β-labeled graphs with n edges. In this paper we use an extended version of the adjacency matrix of a graph to determine the number of gracefully labeled graphs with n edges; furthermore, we also calculate t...
متن کاملLinear Systems on Edge-weighted Graphs
Let R be any subring of the reals. We present a generalization of linear systems on graphs where divisors are R-valued functions on the set of vertices and graph edges are permitted to have nonnegative weights in R. Using this generalization, we provide an independent proof of a Riemann-Roch formula, which implies the Riemann-Roch formula of Baker and Norine.
متن کاملEnumerating Planar Minimally Rigid Graphs
We present an algorithm for enumerating without repetitions all the planar (noncrossing) minimally rigid (Laman) graphs embedded on a given generic set of n points. Our algorithm is based on the Reverse search paradigm of Avis and Fukuda. It generates each output graph in O(n) time and O(n) space, or, with a slightly different implementation, in O(n) time and O(n) space. In particular, we obtai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Zeitschrift
سال: 2020
ISSN: 0025-5874,1432-1823
DOI: 10.1007/s00209-020-02473-0